WSDFU: Program Transformation System Based on Generalized Partial Computation
نویسندگان
چکیده
Generalized Partial Computation (GPC) is a program transformation method utilizing partial information about input data and auxiliary functions as well as the logical structure of a source program. GPC uses both an inference engine such as a theorem prover and a classical partial evaluator to optimize programs. Therefore, GPC is more powerful than classical partial evaluators but harder to implement and control. We have implemented an experimental GPC system called WSDFU (Waseda Simplify-Distribute-Fold-Unfold). This paper demonstrates the power of the program transformation system as well as its theorem prover and discusses some future works.
منابع مشابه
A Comparative Revisitation of Some Program Transformation Techniques
We revisit the main techniques of program transformation which are used in partial evaluation mixed computation supercompi lation generalized partial computation rule based program derivation program specialization compiling control and the like We present a methodology which underlines these techniques as a common pattern of reasoning and explains the various correspondences which can be estab...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملImplementation of an Experimental System for Automatic Program Transformation Based on Generalized Partial Computation
data types of auxiliary functions. A simplification process is successful if the result entails the elimination of all recursive calls to the (user defined) source program through folding. Since the folding process comes after this process, the simplification process is nondeterministic. That is, if the folding process is unsuccessful, we backtrack our SDFU process to the simplification process...
متن کاملIncorporating Proofs in a Categorical Attributed Graph Transformation System for Software Modelling and Verification
This paper deals with model transformations based on attributed graphs transformation. Our approach is based on the categorical approach called Single Pushout. The principal goal being to strengthen the attribute computation part, we generalize our earlier approach based on the use of typed lambda-terms with inductive types and recursion to represent attributes and computation functions. The ge...
متن کاملThe Concept of a Supercompiler, 1986
A supercompiler is a program transformer of a certain type. It traces the possible generalized histories of computation by the original program, and compiles an equivalent program, reducing in the process the redundancy that could be present in the original program. The nature of the redundancy that can be eliminated by supercompilation may be various, e.g., some variables might have predefined...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002